Pseudopalindrome closure operators in free monoids
نویسندگان
چکیده
We consider involutory antimorphisms θ of a free monoid A∗ and their fixed points, called θ-palindromes or pseudopalindromes. A θ-palindrome reduces to a usual palindrome when θ is the reversal operator. For any word w ∈ A∗ the right (resp. left) θ-palindrome closure of w is the shortest θ-palindrome having w as a prefix (resp. suffix). We prove some results relating θ-palindrome closure operators with periodicity and conjugacy, and derive some interesting closure properties for the languages of finite Sturmian and episturmian words. In particular, a finite word w is Sturmian if and only if both its palindromic closures are so. Moreover, in such a case, both the palindromic closures of w share the same minimal period of w. A new characterization of finite Sturmian words follows, in terms of periodicity and special factors of their palindromic closures. Some weaker results can be extended to the episturmian case. By using the right θ-palindrome closure, we extend the construction of standard episturmian words via directive words. In this way one obtains a family of infinite words, called θ-standard words, which are morphic images of episturmian words, as well as a wider family of infinite words including the Thue-Morse word on two symbols.
منابع مشابه
Some Operators on Families of Fuzzy Languages and Their Monoids
We study the structure of partially ordered monoids generated by certain operators on families of fuzzy languages. These operators are induced by simple, well-known operations on fuzzy languages, like fuzzy homomorphism, fuzzy finite substitution and intersection with regular fuzzy languages. The structure of these monoids provides better insight in the (in)dependency of closure properties of s...
متن کاملOn some problems related to palindrome closure
In this paper we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and pseudostandard words. We show that if θ is an involutory antimorphism of A, then both θ-palindromic closures of any factor of a θ-standard word are also factors of some θ-standard word. We also introduce the class of ...
متن کاملRational Codes and Free Profinite Monoids
It is well known that clopen subgroups of finitely generated free profinite groups are again finitely generated free profinite groups. Clopen submonoids of free profinite monoids need not be finitely generated nor free. Margolis, Sapir and Weil proved that the closed submonoid generated by a finite code (which is in fact clopen) is a free profinite monoid generated by that code. In this note we...
متن کامل-torsion free Acts Over Monoids
In this paper firt of all we introduce a generalization of torsion freeness of acts over monoids, called -torsion freeness. Then in section 1 of results we give some general properties and in sections 2, 3 and 4 we give a characterization of monoids for which this property of their right Rees factor, cyclic and acts in general implies some other properties, respectively.
متن کاملM-FUZZIFYING MATROIDS INDUCED BY M-FUZZIFYING CLOSURE OPERATORS
In this paper, the notion of closure operators of matroids is generalized to fuzzy setting which is called $M$-fuzzifying closure operators, and some properties of $M$-fuzzifying closure operators are discussed. The $M$-fuzzifying matroid induced by an $M$-fuzzifying closure operator can induce an $M$-fuzzifying closure operator. Finally, the characterizations of $M$-fuzzifying acyclic matroi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 362 شماره
صفحات -
تاریخ انتشار 2006